A Study on Regular Domination in Vague Graphs with Application
نویسندگان
چکیده
Vague graphs (VGs), which are a family of fuzzy (FGs), well-organized and useful tool for capturing resolving range real-world scenarios involving ambiguous data. In graph theory, dominating set (DS) G ∗ = X , E is subset id="M2"> S the vertices id="M3"> such that every vertex not in id="M4"> adjacent to at least one member id="M5"> . The concept DS FGs has received attention many researchers due its applications various fields as computer science electronic networks. this paper, we introduce notion id="M6"> ϵ 1 2 -Regular vague provide some examples explain concepts introduced. Also, results were discussed. Additionally, id="M7"> strong (weak) independent domination sets (VDS) presented with theorems support context.
منابع مشابه
A note on vague graphs
In this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. Also, density and balanced irregular vague graphs are discussed and some of their properties are established. Finally we give an application of vague digraphs.
متن کاملA Study on Domination Sets in Vague Graphs with Novel Applications
A Study on Domination Sets in Vague Graphs with Novel Applications Hossein Rashmanlou, Abolfazl Lakdashti and Shabanali Safari Sabet Department of Computer Science University College of Rouzbahan, Sari, Iran Department of Mathematics, Islamic Azad University Central Tehran Branch, Tehran, Iran Email: [email protected]; [email protected]; Corresponding author. email: drsafarisabe...
متن کاملA study on vague graphs
The main purpose of this paper is to introduce the notion of vague h-morphism on vague graphs and regular vague graphs. The action of vague h-morphism on vague strong regular graphs are studied. Some elegant results on weak and co weak isomorphism are derived. Also, [Formula: see text]-complement of highly irregular vague graphs are defined.
متن کاملMinus domination in regular graphs
A three-valued function f defined on the vertices of a graph G = (V,E), f : V , ( 1 , 0 , 1), is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every v E V, f(N[v])>~ 1, where N[v] consists of v and every vertex adjacent to v. The weight of a minus dominating function is f ( V ) = ~ f (v) , over all vertices v E V. The mi...
متن کاملConnected domination of regular graphs
A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either v ∈ D or there exists a vertex u ∈ D that is adjacent to v in G. Dominating sets of small cardinality are of interest. A connected dominating set C of a graph G is a dominating set of G such that the subgraph induced by the vertices of C in G is connected. A weakly-connected dominating set W of a g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematical Physics
سال: 2023
ISSN: ['1687-9139', '1687-9120']
DOI: https://doi.org/10.1155/2023/7098134